/*
� 最佳准确率窗口:
{
  windowSize: 11,
  total: 1234,
  correct: 810,
  accuracy: 65.64,
  maxWrongStreak: 6
}

� 最小连续错误窗口:
{
  windowSize: 2,
  total: 1243,
  correct: 811,
  accuracy: 65.25,
  maxWrongStreak: 6
}

*/
// 📦 引入工具库
const _ = require("lodash");
const path = require("path");
const fs = require("fs");

// 📦 ESM 支持模块加载
const esm = require("esm");
const requireModule = esm(module);

// 📦 项目依赖模块
const { readAllValues } = requireModule(
  "../../../awakened-potential/helpers/readAllValues.js"
);
const checkAccuracy = requireModule("../../utils/checkAccuracy.js");

// ✅ 读取历史开奖数据（模拟全部）
const allValues = readAllValues("m");

// ✅ 号码池（01 ~ 49）
const allNumbers = Array.from({ length: 49 }, (_, i) =>
  (i + 1).toString().padStart(2, "0")
);

// ✅ 是否使用窗口
const useWindow = true;

// ✅ 基于最近连续号趋势策略
function select32ByRecentConsecutive(temp) {
  const consecutivePairs = [];

  // 找到最近的连续号码对
  for (let i = 1; i < temp.length; i++) {
    const currentNum = parseInt(temp[i].number, 10);
    const prevNum = parseInt(temp[i - 1].number, 10);
    
    // 判断是否为连续号码
    if (currentNum === prevNum + 1) {
      consecutivePairs.push([prevNum, currentNum]);
    }
  }

  // 如果有连续号对，选择新的连续号
  const selected = [];
  if (consecutivePairs.length > 0) {
    // 获取当前的连续对
    consecutivePairs.forEach(pair => {
      const start = pair[1];  // 当前连续号的最大值
      const nextConsecutivePair = [start + 1, start + 2]; // 下一组连续号
      selected.push(nextConsecutivePair[0], nextConsecutivePair[1]);
    });
  }

  // 如果选出的号码不足32个，则从所有号码中按顺序补充
  if (selected.length < 32) {
    const remain = allNumbers.filter((n) => !selected.includes(n));
    const needed = 32 - selected.length;
    selected.push(...remain.slice(0, needed));  // 从未选中的号码中按顺序补充
  }

  return selected;
}

// ✅ 多窗口循环测试结果
const testResults = [];

for (let windowSize = 2; windowSize <= 200; windowSize++) {
  let correct = 0;
  let maxWrongStreak = 0;
  let currentWrongStreak = 0;
  const predictResults = [];

  allValues.forEach((item, index) => { 
    const temp = useWindow ? allValues.slice(index - windowSize, index) : allValues.slice(0, index);

    if (temp.length === 0) return;

    const selectedNumbers = select32ByRecentConsecutive(temp);

    if (selectedNumbers.length !== 32) {
      throw new Error("选出的32个号码数量不正确");
    }

    try {
      const isHit = checkAccuracy(selectedNumbers, item.number);
      if (isHit) {
        correct += 1;
        currentWrongStreak = 0;
      } else {
        currentWrongStreak += 1;
        maxWrongStreak = Math.max(maxWrongStreak, currentWrongStreak);
      }
      predictResults.push(selectedNumbers);
    } catch (err) {
      console.error(`❌ checkAccuracy error at index ${index}: ${err.message}`);
    }
  });

  const total = predictResults.length;
  const accuracy = total > 0 ? ((correct / total) * 100).toFixed(2) : 0;

  testResults.push({
    windowSize,
    total,
    correct,
    accuracy: Number(accuracy),
    maxWrongStreak,
  });
}

// ✅ 输出所有窗口测试结果
testResults.forEach((res) => {
  console.log(
    `windowSize = ${res.windowSize}, 准确率 = ${res.accuracy}%, 最大连续错误次数 = ${res.maxWrongStreak}`
  );
});

// ✅ 输出最佳结果
const bestAcc = _.maxBy(testResults, "accuracy");
const bestStable = _.minBy(testResults, "maxWrongStreak");

console.log("\n🎯 最佳准确率窗口:");
console.log(bestAcc);
console.log("\n🧱 最小连续错误窗口:");
console.log(bestStable);
